Nuprl Lemma : R-interface-base 0,22

AB:Realizer.
Rplus?(A)
 Rplus?(B)
 R-Feasible(A)
 R-Feasible(B)
 A || B
 interface-compatible([[A]];[[B]]) 
latex


Definitionsx:AB(x), P  Q, b, interface-compatible(A;B), [[R]], if b t else f fi, P & Q, Rnone?(x1), True, true, false, t  T, SQType(T), {T}, Prop, P  Q, P  Q, , xt(x), Dsys, T, t  ...$L, Realizer, A, A || B, Y, P  Q, False, Unit, x(s), Dec(P), interface-link(A;B;l;tg), , , left  right, @loc x initially v:T, @loc only events in L change x:T, only events in L send on lnk with tag, @loc effect knd(v:T)  x := f State(ds) v , sends knd(v:T) on l:tagged(g,State(ds),v):dt, @loc precondition for a(v:T):P State(ds) v, @lock writes only members of L, @lock sends only on links in L, @loc: only members of L read x
Lemmasbool cases, bool sq, bool wf, eqtt to assert, iff transitivity, assert wf, bnot wf, eqff to assert, assert of bnot, Rnone? wf, unit wf, Id wf, Knd wf, IdLnk wf, fpf wf, decl-state wf, decl-type wf, true wf, false wf, interface-compatible-symmetry, R-Dsys wf, ma-empty wf, interface-compatible-null, not wf, interface-compatible wf, squash wf, msga wf, R-Dsys-base, decidable or, Reffect? wf, Rsends? wf, decidable assert, ma-declm-R-base-ma, ldst wf, interface-link wf, m-sys-at wf2, R-loc wf, R-base-ma wf, lsrc wf, R-compat wf, R-Feasible wf, Rplus? wf, es realizer wf

origin